Towards a Black-Box Solver for Finite Games
نویسنده
چکیده
This paper describes a new implementation of an algorithm to find all isolated Nash equilibria in a finite strategic game. The implementation uses the game theory software package Gambit to generate systems of polynomial equations which are necessary conditions for a Nash equilibrium, and polyhedral homotopy continuation via the package PHCpack to compute solutions to the systems. Numerical experiments to characterize the performance of the implementation are reported. In addition, the current and future roles of support enumeration methods in the context of methods for computing Nash equilibria are discussed.
منابع مشابه
Algebraic Multicolor Ordering for Parallelized ICCG Solver in Finite-Element Analyses
This paper proposes a new black-box-type parallel processing method for the incomplete Cholesky conjugate gradient (ICCG) solver. The new method is based on a multicolor ordering concept and an automatic reordering process in the solver. Parallel performance is evaluated in the context of three-dimensional finite edge-element eddy-current analysis. The proposed method attains high parallelism w...
متن کاملA Black-Box Multigrid Preconditioner for the Biharmonic Equation
We examine the convergence characteristics of a preconditioned Krylov subspace solver applied to the linear systems arising from low-order mixed finite element approximation of the biharmonic problem. The key feature of our approach is that the preconditioning can be realized using any “black-box” multigrid solver designed for the discrete Dirichlet Laplacian operator. This leads to preconditio...
متن کاملApplications of automata learning in verification and synthesis
The objective of this thesis is to explore automata learning, which is an umbrella term for techniques that derive finite automata from external information sources, in the areas of verification and synthesis. We consider four application scenarios that turn out to be particularly well-suited: Regular Model Checking, quantified invariants of linear data structures, automatic reachability games,...
متن کاملAdaptive Multiscale Methods for Flow Problems: Recent Developments
The concept of the new fully adaptive flow solver Quadflow has been developed within the SFB 401 over the past 12 years. Its primary novelty lies in the integration of new and advanced mathematical tools in a unified environment. This means that the core ingredients of the finite volume solver, the grid adaptation and grid generation are adapted to each others needs rather than putting them tog...
متن کاملA Parallel Wavelet-Based Algebraic Multigrid Black-Box Solver and Preconditioner
This work introduces a new parallel wavelet-based algorithm for algebraic multigrid method PWAMG using a variation of the standard parallel implementation of discrete wavelet transforms. This new approach eliminates the grid coarsening process in traditional algebraic multigrid setup phase simplifying its implementation on distributed memory machines. The PWAMG method is used as a parallel blac...
متن کامل